Coherence-based Partial Exact Recovery Condition for OMP/OLS

نویسندگان

  • Cédric Herzet
  • Charles Soussen
  • Jérôme Idier
  • Rémi Gribonval
چکیده

We address the exact recovery of the support of a k-sparse vector with Orthogonal Matching Pursuit (OMP) and Orthogonal Least Squares (OLS) in a noiseless setting. We consider the scenario where OMP/OLS have selected good atoms during the first l iterations (l < k) and derive a new sufficient and worst-case necessary condition for their success in k steps. Our result is based on the coherence μ of the dictionary and relaxes Tropp’s well-known condition μ < 1/(2k − 1) to the case where OMP/OLS have a partial knowledge of the support.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse recovery via Orthogonal Least-Squares under presence of Noise

We consider the Orthogonal Least-Squares (OLS) algorithm for the recovery of a m-dimensional k-sparse signal from a low number of noisy linear measurements. The Exact Recovery Condition (ERC) in bounded noisy scenario is established for OLS under certain condition on nonzero elements of the signal. The new result also improves the existing guarantees for Orthogonal Matching Pursuit (OMP) algori...

متن کامل

Signal Recovery in Uncorrelated and Correlated Dictionaries Using Orthogonal Least Squares

Abstract—Though the method of least squares has been used for a long time in solving signal processing problems, in the recent field of sparse recovery from compressed measurements, this method has not been given much attention. In this paper we show that a method in the least squares family, known in the literature as Orthogonal Least Squares (OLS), adapted for compressed recovery problems, ha...

متن کامل

Online Recovery Guarantees and Analytical Results for OMP

Orthogonal Matching Pursuit (OMP) is a simple, yet empirically competitive algorithm for sparse recovery. Recent developments have shown that OMP guarantees exact recovery of K-sparse signals with K or more than K iterations if the observation matrix satisfies the restricted isometry property (RIP) with some conditions. We develop RIP-based online guarantees for recovery of a K-sparse signal wi...

متن کامل

A sharp recovery condition for sparse signals with partial support information via orthogonal matching pursuit

This paper considers the exact recovery of k-sparse signals in the noiseless setting and support recovery in the noisy case when some prior information on the support of the signals is available. This prior support consists of two parts. One part is a subset of the true support and another part is outside of the true support. For k-sparse signals x with the prior support which is composed of g ...

متن کامل

Support Recovery with Orthogonal Matching Pursuit in the Presence of Noise: A New Analysis

Support recovery of sparse signals from compressed linear measurements is a fundamental problem in compressed sensing (CS). In this paper, we study the orthogonal matching pursuit (OMP) algorithm for the recovery of support under noise. We consider two signal-to-noise ratio (SNR) settings: i) the SNR depends on the sparsity level K of input signals, and ii) the SNR is an absolute constant indep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1211.7283  شماره 

صفحات  -

تاریخ انتشار 2012